Real-time visual attention on a massively parallel SIMD architecture
نویسندگان
چکیده
منابع مشابه
Real-time visual attention on a massively parallel SIMD architecture
Visual attention is the ability to rapidly detect the visually salient parts of a given scene on which higher level vision tasks, such as object recognition, can focus. Found in biological vision, this mechanism represents a fundamental tool for computer vision. This paper reports the first real-time implementation of the complete visual attention mechanism on a compact and low-power architectu...
متن کاملReal-time Obstacle Detection on a Massively Parallel Linear Architecture
This paper presents a real-time solution to the problem of obstacle detection in automotive applications using image processing techniques. To speed-up the processing a massively parallel engine has been used and the algorithms tuned to match the speciic features of the computing architecture. The system acquires pairs of stereo images, checks for correspondences, and remaps the resulting image...
متن کاملC++ programming language for an abstract massively parallel SIMD architecture
The aim of this work is to define and implement an extended C++ language to support the SIMD programming paradigm. The C++ programming language has been extended to express all the potentiality of an abstract SIMD machine consisting of a central Control Processor and a N-dimensional toroidal array of Numeric Processors. Very few extensions have been added to the standard C++ with the goal of mi...
متن کاملReal-Time Road Signs Recognition on a SIMD Architecture
An Automatic Road Sign Recognition System {A(RS)2} is aimed at detection and recognition of one or more road signs from real-world color images. The authors have already proposed an A(RS)2 able to detect and extract sign regions from real world scenes on the basis of their color and shape features. Classification is then performed on extracted candidate regions using Multi-Layer Perceptron neur...
متن کاملParallel Genetic Simulated Annealing: A Massively Parallel SIMD Algorithm
Many significant engineering and scientific problems involve optimization of some criteria over a combinatorial configuration space. The two methods most often used to solve these problems effectively—simulated annealing (SA) and genetic algorithms (GA)—do not easily lend themselves to massive parallel implementations. Simulated annealing is a naturally serial algorithm, while GA involves a sel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Real-Time Imaging
سال: 2003
ISSN: 1077-2014
DOI: 10.1016/s1077-2014(03)00036-6